Full families of generalized interval exchange transformations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Languages of k-interval exchange transformations

This paper gives a complete characterization of those sequences of subword complexity (k− 1)n + 1 that are natural codings of orbits of k-interval exchange transformations, thereby answering an old question of Rauzy.

متن کامل

Joinings of Three-interval Exchange Transformations

We show that among three-interval exchange transformations there exists a dichotomy: T has minimal self-joinings whenever the associated subshift is linearly recurrent, and is rigid otherwise. We build also a family of simple rigid three-interval exchange transformations, which is a step towards an old question of Veech, and a family of rigid three-interval exchange transformations which includ...

متن کامل

Eigenvalues and Simplicity of Interval Exchange Transformations

In this paper we consider a class of d-interval exchange transformations, which we call the symmetric class. For this class we define a new self-dual induction process in which the system is successively induced on a union of sub-intervals. This algorithm gives rise to an underlying graph structure which reflects the dynamical behavior of the system, through the Rokhlin towers of the induced ma...

متن کامل

Structure of three interval exchange transformations I: an arithmetic study

L’accès aux articles de la revue « Annales de l’institut Fourier » (http://aif.cedram.org/), implique l’accord avec les conditions générales d’utilisation (http://aif.cedram.org/legal/). Toute reproduction en tout ou partie cet article sous quelque forme que ce soit pour tout usage autre que l’utilisation à fin strictement personnelle du copiste est constitutive d’une infraction pénale. Toute c...

متن کامل

Combinatorial trees arising in the study of interval exchange transformations

In this paper we study a new class of combinatorial objects that we call trees of relations equipped with an operation that we call induction. These trees were first introduced in Ferenczi and Zamboni (2010) [3] in the context of interval exchange transformations but they may be studied independently from a purely combinatorial point of view. They possess a variety of interesting combinatorial ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nonlinearity

سال: 2018

ISSN: 0951-7715,1361-6544

DOI: 10.1088/1361-6544/aae737